Equivalence of induced representations
نویسندگان
چکیده
منابع مشابه
Acquired equivalence changes stimulus representations.
Acquired equivalence is a paradigm in which generalization is increased between two superficially dissimilar stimuli (or antecedents) that have previously been associated with similar outcomes (or consequents). Several possible mechanisms have been proposed, including changes in stimulus representations, either in the form of added associations or a change of feature salience. A different way o...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولFundamental Equivalence of Discrete-Time AR Representations
We examine the problem of equivalence of discrete time auto-regressive representations (DTARRs) over a finite time interval. Two DTARRs are defined as fundamentally equivalent (FE) over a finite time interval [0, N ] if their solution spaces or behaviours are isomorphic. We generalise the concept of strict equivalence (SE) of matrix pencils to the case of general polynomial matrices and in turn...
متن کاملCounting Equivalence Classes of Irreducible Representations
Let n be a positive integer, and let R be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether R has at most finitely many equivalence classes of ndimensional irreducible representations. When R does have only finitely many such equivalence classes, they can be effectively counte...
متن کاملEquivalence-free exhaustive generation of matroid representations
In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite (partial) field, and which contain a given minor. The nature of this problem is exponential, and it appears to be much harder than, say, isomorph-free generation of graphs. Still, our algorithm is very suitable for practical u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Physics
سال: 1980
ISSN: 0022-2488
DOI: 10.1063/1.524354